A Novel Cache-based Approach to Large Polygonal Mesh Simplification
نویسندگان
چکیده
HUNG-KUANG CHEN, CHIN-SHYURNG FAHN, JEFFREY J. P. TSAI AND MING-BO LIN Department of Electronic Engineering Department of Computer Science and Information Engineering National Taiwan University of Science and Technology Taipei, 106 Taiwan Department of Information and Design Asia University Taichung, 413 Taiwan Department of Computer Science University of Illinois at Chicago Chicago, IL 60637, U.S.A.
منابع مشابه
Interactive Visualization and Collision Detection using Dynamic Simplification and Cache-Coherent Layouts
SUNG-EUI YOON: Interactive Visualization and Collision Detection using Dynamic Simplification and Cache-Coherent Layouts (Under the direction of Dinesh Manocha) Recent advances in model acquisition, computer-aided design, and simulation technologies have resulted in massive databases of complex geometric models consisting of more than tens or hundreds of millions of triangles. In spite of the r...
متن کاملScalable rendering for very large meshes
In this paper, we present a novel approach for rendering of very large polygonal meshes consisting of several hundred million triangles. Our technique uses the rasterizer exclusively to allow for high-quality, anti-aliased rendering and takes advantage of a compact, voxel-based level-of-detail simplification. We show how our approach unifies streaming, occlusion culling, and level-of-detail int...
متن کاملPAT: A pattern classification approach to automatic reference oracles for the testing of mesh simplification programs
Graphics applications often need to manipulate numerous graphical objects stored as polygonal models. Mesh simplification is an approach to vary the levels of visual details as appropriate, thereby improving on the overall performance of the applications. Different mesh simplification algorithms may cater for different needs, producing diversified types of simplified polygonal model as a result...
متن کاملMesh Simplification via a Volume Cost Measure
We develop a polygonal mesh simplification algorithm based on a novel analysis of the mesh geometry. Particularly, we propose first a characterization of vertices as hyperbolic or non-hyperbolic depend-ing upon their discrete local geometry. Subsequently, the simplification process computes a volume cost for each non-hyperbolic vertex, in anal-ogy with spherical volume, to capture the loss of f...
متن کاملParallel Model Simplification of Very Large Polygonal Meshes
Working with polygonal models that contain tens of millions of polygons or more is difficult because such models tend not to fit into the core memory of a typical workstation. Even models of only a few million polygons are too large. A typical workstation has a gigabyte of memory, but these large models require an order of magnitude more. Rendering and other manipulations of polygonal models of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Inf. Sci. Eng.
دوره 22 شماره
صفحات -
تاریخ انتشار 2006